RSA-Based Undeniable Signatures

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RSA-Based Undeniable Signatures for General Moduli

Gennaro, Krawczyk and Rabin gave the first undeniable signature scheme based on RSA signatures. However, their solution required the use of RSA moduli which are a product of safe primes. This paper gives techniques which allow RSA-based undeniable signatures for gen-

متن کامل

Convertible Undeniable Standard RSA Signatures

A convertible undeniable signature is issued as an undeniable signature which can provide good privacy service in its early lifecycle. Later when necessary, it can be converted into an ordinary signature by a designated party and thereafter assures good accountability just as an ordinary digital signature does. We propose an RSA-based convertible undeniable signature where, in the stage of unde...

متن کامل

Identity Based Undeniable Signatures

In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security model for the notions of invisibility and anonymity given by Galbraith and Mao in 2003 and we prove that our scheme is existentially unforgeable under the Bilinear Diffie-Hellman assumption in the random oracle model. We also pro...

متن کامل

Generic Homomorphic Undeniable Signatures

We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniable signature scheme which generalizes the MOVA schemes. Our scheme is generic in the sense that we transform a private group homomorphism from publi...

متن کامل

Isogeny-Based Quantum-Resistant Undeniable Signatures

We propose an undeniable signature scheme based on elliptic curve isogenies, and prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. Our proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Cryptology

سال: 2007

ISSN: 0933-2790,1432-1378

DOI: 10.1007/s00145-007-0202-1